منابع مشابه
E-optimal Semi-regular Graph Designs and Partially Efficiency Balanced Designs
Jacroux (1985) extended the definition of Regular graph designs of Mitchell and John (1976) to Semi-regular graph (SRG) designs, and studied the type 1 optimality of block designs. Here, the construction and optimality of some more SRG designs are discussed. Moreover, in this investigation, it is established that a class of two associate partially efficiency balanced design is, in fact SRG desi...
متن کاملA family of resolvable regular graph designs
A regular graph design RGD(v; k; r) is a design on v points with blocks of size k and constant replication number r, such that any two points belong to either 1 or 1 +1 common blocks, for some constant 1. We investigate resolvable regular graph designs with block size 4. In particular we determine the spectrum of such designs for v 16.
متن کاملTheta Graph Designs
We solve the design spectrum problem for all theta graphs with 10, 11, 12, 13, 14 and 15 edges.
متن کاملSome Optimal Codes From Designs
The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.
متن کاملHalf-regular symmetric designs
This paper is of an investigation of symmetric 2 (v, k,'x) designs such that the point set and the block set can each be halved to give a tactical decomposition. We assume that there is a group of automorphisms of the design of order v /2 which has two orbits of points, each of length v /2. Only the identity fixes a point, and we say that such a group acts half-regularly on the design. The desi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics and Computing
سال: 2017
ISSN: 0960-3174,1573-1375
DOI: 10.1007/s11222-016-9720-8